Nearest neighbor and hard sphere models in continuum percolation
نویسندگان
چکیده
Consider a Poisson process X in Rd with density 1. We connect each point of X to its k nearest neighbors by undirected edges. The number k is the parameter in this model. We show that, for k = 1, no percolation occurs in any dimension, while, for k = 2, percolation occurs when the dimension is sufficiently large. We also show that if percolation occurs, then there is exactly one infinite cluster. Another percolation model is obtained by putting balls of radius zero around each point of X and let the radii grow linearly in time until they hit another ball. We show that this model exists and that there is no percolation in the limiting configuration. Finally we discuss some general properties of percolation models where balls placed at Poisson points are not allowed to overlap (but are allowed to be tangent).
منابع مشابه
Random nearest neighbor and influence graphs on Zd
Random nearest neighbor and influence graphs with vertex set Zd are defined and their percolation properties are studied. The nearest neighbor graph has (with probability 1) only finite connected components and a superexponentially decaying connectivity function. Influence graphs (which are related to energy minimization searches in disordered Ising models) have a percolation transition. © 1999...
متن کاملDecay of Correlations in Nearest - Neighbor Self - Avoiding Walk , Percolation , Lattice Trees and Animals
We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usin...
متن کاملComputer Simulations of Nearest-neighbor Distribution Functions and Related Quantities for Hard-sphere Systems
One of the fundamental quantities which statistically characterizes a random system of interacting particles is the nearest-neighbor distribution function. We present computer-simulation results for two different types of nearest-neighbor distribution functions for random distributions of identical impenetrable (hard) spheres. We also report, for such systems, computer-simulation data for close...
متن کاملRandom Growth Models
Irregular and stochastic growth is all around us: tumors, bacterial colonies, infections, fluid spreading in a porous medium, propagating flame fronts. The study of simplified mathematical models of stochastic growth began in probability theory half a century ago. Quite serendipitously these models have turned out to be extremely hard to analyze. They have inspired innovative probability theory...
متن کاملOrdering and percolation transitions for hard squares: Equilibrium versus nonequilibrium models for adsorbed layers with c(2X2) superlattice ordering
We study the critical behavior of models for adsorbed layers in which particles reside on a square lattice and have infinite nearest-neighbor repulsions. Such particles are often described as ''hard squares.'' We consider both the equilibrium hard-square model and a nonequilibrium model. The latter involves dimer adsorption onto diagonally adjacent sites, and the desorption and possible hopping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 1996